package com.lark.algorithm.study.map;

/**
 * @author btmood
 * @version 1.0
 * @apiNote 映射
 * @since 2024-05-06 21:29
 */
public interface Map<K, V> {
    void add(K key, V value);
    V remove(K key);
    boolean contains(K key);
    V get(K key);
    void set(K key, V value);
    int getSize();
    boolean isEmpty();
}
